Find deepest node(s) of a binary tree

最新推荐文章于 2020-03-18 23:01:52 发布

转载最新推荐文章于 2020-03-18 23:01:52 发布 · 436 阅读

算法同时被 2 个专栏收录

537 篇文章

订阅专栏

java

43 篇文章

订阅专栏

本文介绍了一种使用预序遍历来查找二叉树中最深节点的方法，通过递归函数传递包含层级和节点列表的数组，实现层级跟踪并更新最深节点。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

http://www.dsalgo.com/2013/03/find-deepest-nodes-of-binary-tree.html

We do a preorder traversal of the tree. While calling the recursive function we pass an array containing level and list of nodes. During the preorder traversal, this same array is always passed. So the elements of this array work as global variables. Whenever we call the recursive function to a node's children we increase the level by 1. At each node if the level value in the array is less than the current level value then we clear the previous node list, as we found a deeper level. If the level value is equal then we keep on adding the current node in the list.

import java.util.ArrayList;
import java.util.List;

public class FindDeepestNodes
{
 public static void main(String[] args)
 {
  Node a = new Node(1);
  Node b = new Node(2);
  Node c = new Node(3);
  Node d = new Node(4);
  Node e = new Node(5);
  Node f = new Node(8);
  Node g = new Node(6);
  Node h = new Node(7);
  a.left = b;
  a.right = c;
  b.left = d;
  b.right = e;
  c.right = f;
  f.left = g;
  f.right = h;

  List nodes = findDeepestNodes(a);
  for (Node node : nodes)
  {
   System.out.print(node.value + ", ");
  }
 }

 @SuppressWarnings("unchecked")
 private static List findDeepestNodes(Node root)
 {
  Object[] levelNodes = new Object[2];
  levelNodes[0] = 0;
  levelNodes[1] = new ArrayList();
  findDeepestNodes(root, 1, levelNodes);
  return (List) levelNodes[1];
 }

 @SuppressWarnings("unchecked")
 private static void findDeepestNodes(Node root, int level,
   Object[] levelNodes)
 {
  if (root == null)
   return;
  if((Integer)levelNodes[0]<=level)
  {
   if((Integer)levelNodes[0] < level)
    ((List)levelNodes[1]).clear();
   levelNodes[0]=level;
   ((List)levelNodes[1]).add(root);
  }
  findDeepestNodes(root.left, level+1, levelNodes);
  findDeepestNodes(root.right, level+1, levelNodes); 
 }

 static class Node
 {
  Node left;
  Node right;
  int value;

  public Node(int value)
  {
   this.value = value;
  }
 }

}