简体繁体 English

如何返回二叉搜索树中最深节点的密钥？（递归）

[英]How to return the key of the deepest node in a binary search tree ? (Recursive)

原文 2018-12-01 17:55:30 5 2 java/ recursion/ binary-tree/ binary-search-tree

The key is an int value in a BST. 密钥是BST中的int值。

I've solved a question before that asked for the deepest node size; 在解决了最深的节点大小之前，我已经解决了一个问题。 which wasn't too difficult. 这并不困难。 But I'm not sure how to return the depth to compare for the deepest node and at the same time retrieve the value of the key of that node. 但是我不确定如何返回深度以与最深的节点进行比较，同时获取该节点的键值。 I mean how many return values do you have? 我的意思是您有多少个返回值？

2 个解决方案

According to this link , you need to declare an object that holds a key value and a depth value. 根据此链接，您需要声明一个包含键值和深度值的对象。 Then, you need to return this object. 然后，您需要返回该对象。

As Notrius posted, having a POJO should be simple enough to solve the problem. 正如Notrius所说，拥有POJO应该足够简单以解决问题。 Just for your knowledge, some languages do support the concept of tuples, triplets etc. Java in itself doesn't support this, but there are some simpler libraries to supplement this. 仅就您所知，某些语言确实支持元组，三元组等的概念。Java本身不支持此功能，但是有一些更简单的库可以对此进行补充。 For example, Introduction to Javatuples 例如， Javatuples简介

找到二叉树的最深节点。如果多个节点在最深层，则返回最右边的节点。（答案在说明中） - Find The Deepest Node Of A Binary Tree. If Multiple Nodes Are At The Deepest Level, Then Return The Rightmost Node. (the answer is in the desc)

如何在二叉树中搜索一个节点并返回它？ - How to search for a node in a binary tree and return it?

如何在不使用递归方法的情况下找到二叉搜索树的节点 - How to find a Node of a Binary Search Tree without using a recursive method

递归搜索非二叉树中的节点 - Recursive search for a node in non-binary tree

Java二进制搜索树删除递归返回已删除元素 - Java binary search tree delete recursive return removed element

如何在非二叉树的一次递归搜索中获取节点的深度 - How to get depth of a node in one recursive search in non-binary tree

二叉搜索树递归插入 - Binary search tree recursive insert

递归二叉搜索树删除 - Recursive Binary Search Tree Deletion

二进制搜索树递归添加 - Binary Search Tree recursive add

二进制搜索树递归删除 - Binary Search Tree Recursive Delete

暂无

暂无

声明:本站的技术帖子网页，遵循CC BY-SA 4.0协议，如果您需要转载，请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.

相关问题 找到二叉树的最深节点。如果多个节点在最深层，则返回最右边的节点。（答案在说明中） - Find The Deepest Node Of A Binary Tree. If Multiple Nodes Are At The Deepest Level, Then Return The Rightmost Node. (the answer is in the desc) 如何在二叉树中搜索一个节点并返回它？ - How to search for a node in a binary tree and return it? 如何在不使用递归方法的情况下找到二叉搜索树的节点 - How to find a Node of a Binary Search Tree without using a recursive method 递归搜索非二叉树中的节点 - Recursive search for a node in non-binary tree Java二进制搜索树删除递归返回已删除元素 - Java binary search tree delete recursive return removed element 如何在非二叉树的一次递归搜索中获取节点的深度 - How to get depth of a node in one recursive search in non-binary tree 二叉搜索树递归插入 - Binary search tree recursive insert 递归二叉搜索树删除 - Recursive Binary Search Tree Deletion 二进制搜索树递归添加 - Binary Search Tree recursive add 二进制搜索树递归删除 - Binary Search Tree Recursive Delete

相关标签

粤ICP备18138465号 © 2020-2024 STACKOOM.COM