Package adt.tree

Examples of adt.tree.TreeNode

28
29
30
31
32
33
34
35
36
import adt.tree.TreeNode;

public class Q073A_Print_all_nodes_that_are_at_distance_k_from_a_leaf_node {

  public static void main(String[] args) {
    TreeNode root = Tree.tree15();
    int k = 1;
    printKDistantfromLeaf(root, k);
  }
View Full Code Here
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
import adt.tree.TreeNode;

public class Q040_Vertical_Sum_in_a_given_Binary_Tree {

  public static void main(String[] args) {
    TreeNode root = Tree.tree1();
    Map<Integer, ArrayList<TreeNode>> map = new TreeMap<Integer, ArrayList<TreeNode>>();
   
    verticalSum(root, 0, map);
   
    // print out the sums
    for (Map.Entry<Integer, ArrayList<TreeNode>> entry : map.entrySet()) {
      int sum = 0;
      ArrayList<TreeNode> list = entry.getValue();
      for (int i = 0; i < list.size(); i++) {
        TreeNode node = list.get(i);
        sum += node.val;
      }
     
      System.out.format("%d ", sum);
    }
View Full Code Here
26
27
28
29
30
31
32
33
import adt.tree.TreeNode;

public class Q005_Delete_a_Tree {
 
  public static void main(String[] args) {
    TreeNode root = Tree.tree1();
    deleteTree(root);
  }
View Full Code Here
20
21
22
23
24
25
26
27
28
29
30
import adt.tree.TreeNode;

public class Q012_Check_if_a_binary_tree_is_BST_or_not {

  public static void main(String[] args) {
    TreeNode root = Tree.bst2();
   
    boolean res1 = isBSTPreorder(root);
    System.out.println(res1);
   
    boolean res2 = isBSTPostorder(root);
View Full Code Here
51
52
53
54
55
56
57
58
59
60
61
62
    if (root == n1 || root == n2) {
      return root;
    }
   
    // Look for keys in left and right subtrees
      TreeNode left_lca  = findLCA(root.left, n1, n2);
      TreeNode right_lca = findLCA(root.right, n1, n2);
     
      // If both of the above calls return Non-NULL, then one key
      // is present in once subtree and other is present in other,
      // So this node is the LCA
      if (left_lca != null && right_lca != null) 
View Full Code Here
47
48
49
50
51
52
53
54
55
import adt.tree.TreeNode;

public class Q004_Find_the_Maximum_Depth_or_Height_of_a_Tree {

  public static void main(String[] args) {
    TreeNode root = Tree.tree1();
    int height = maxDepth(root);
    System.out.println(height);
  }
View Full Code Here
31
32
33
34
35
36
37
38
import adt.tree.TreeNode;

public class Q047_Boundary_Traversal_of_binary_tree {

  public static void main(String[] args) {
    TreeNode root = Tree.bst2();
    printBoundary(root);
  }
View Full Code Here
24
25
26
27
28
29
30
31
import adt.tree.TreeNode;

public class Q030_Print_BST_keys_in_the_given_range {

  public static void main(String[] args) {
    TreeNode root = Tree.bst2();
    print(root, 10, 22);
  }
View Full Code Here
15
16
17
18
19
20
21
22
23
import adt.tree.TreeNode;

public class Q027A_Find_kth_smallest_element_in_BST {

  public static void main(String[] args) {
    TreeNode root = Tree.bst2();
    TreeNode node = findKthSmallest(root, 5);
    System.out.println(node.val);
  }
View Full Code Here
42
43
44
45
46
47
48
49
50
51
52
    if (root == null || k < 1) {
      return null;
    }
   
    Stack<TreeNode> stack = new Stack<TreeNode>();
    TreeNode curr = root;
   
    int count = 1;
    while (!stack.isEmpty() || curr != null) {
      if (curr != null) {
        stack.push(curr);
View Full Code Here
TOP

Related Classes of adt.tree.TreeNode

  • adt.tree.Tree
  • problems.geeks.linkedlist.Q026A_Sorted_Linked_List_to_Balanced_BST
  • problems.geeks.linkedlist.Q026B_Sorted_Linked_List_to_Balanced_BST
  • problems.geeks.tree.Q001_Tree_Traversals
  • problems.geeks.tree.Q002_Calculate_Size_of_a_tree
  • problems.geeks.tree.Q003_Determine_if_Two_Trees_are_Identical
  • problems.geeks.tree.Q004_Find_the_Maximum_Depth_or_Height_of_a_Tree
  • problems.geeks.tree.Q005_Delete_a_Tree
  • problems.geeks.tree.Q006_Convert_a_Binary_Tree_into_its_Mirror_Tree
  • problems.geeks.tree.Q007_Print_out_all_of_its_root_to_leaf_paths_one_per_line
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.