Tree data structure Interview questions - Detailed explanation and sample code in Java Nikhil Ranjan October 30, 2015 Data structure and Algorithm Interview Question, Tree No comments Binary tree traversal in Java - Preorder,Inorder,Postorder Iterative(non-recursive) preorder traversal of binary tree in Java Iterative(non-recursive) inorder traversal of binary tree in Java Iterative(non-recursive) postorder traversal of binary tree in Java - Using two stack Iterative(non-recursive) postorder traversal of binary tree in Java - Using one stack Iterative level order traversal of binary tree in Java Find sum of all elements of binary tree in Java - Iterative and recursive Sum of nodes at each level of binary tree in Java Find number of full and half nodes in binary tree Find level with maximum sum in binary tree - display nodes and sum both Find height of binary tree in Java - Recursive and Iterative Find size of binary tree in Java - Iterative and recursive Search(find) an element in binary tree in Java - Recursive and Iterative Find maximum element node in binary tree in Java - Recursive and Iterative Level order traversal in reverse order in Java - From leaf nodes to root Zigzag level order traversal of binary tree in Java Find diameter/width of binary tree in Java Read also:- Linked list interview questions and sample code in Java - Data structure and algorithm Share This: Facebook Twitter Google+ Stumble Digg LinkedIn Email ThisBlogThis!Share to TwitterShare to Facebook
0 comments:
Post a Comment