Page 1 of 1
Binary Search Trees: Observe the insert method we wrote for a binary search tree in class: public void add (T element) i
Posted: Fri Jun 17, 2022 1:01 am
by answerhappygod
- Binary Search Trees Observe The Insert Method We Wrote For A Binary Search Tree In Class Public Void Add T Element I 1 (27.46 KiB) Viewed 12 times
- Binary Search Trees Observe The Insert Method We Wrote For A Binary Search Tree In Class Public Void Add T Element I 2 (23.63 KiB) Viewed 12 times
Binary Search Trees: Observe the insert method we wrote for a binary search tree in class: public void add (T element) if (root == null) { } else ( root = new Node (element); size++; root = add (element, root); private Node add (T element, Node current) { if (current== null) { size++; return new Node (element); } int compare = current.data.compareTo (element); if (compare < 0) { current.right = add (element, current.right); } else if (compare > 0) E current.left = add (element, current.left); } return current; }
3 5 02 01 O 3 04 4 5 6 9 7 (17) (20) (22)