blocks|key|93888|text|这是你给定的术语，为了清楚起见，印刷得很漂亮：|type|unstyled|depth|inlineStyleRanges|entityRanges|data|93889|tree(1,++++++%25+has+2+child+nodes
++++++tree(11,+++++++%25+has+2+child+nodes
+++++++++++++tree(111,n,n),+++++%25+a+leaf
+++++++++++++tree(112,++++++++++%25+has+2+child+nodes
+++++++++++++++++++++tree(1121,n,n),++++++++++%25+a+leaf
+++++++++++++++++++++n)),+++++++++++++++++++++%25+empty
++++++tree(12,+++++++%25+has+4+child+nodes
+++++++++++++tree(121,n,n),+++++%25+a+leaf
+++++++++++++tree(122,n,n),+++++%25+a+leaf
+++++++++++++tree(123,n,n),+++++%25+a+leaf
+++++++++++++tree(124,++++++++++%25+has+two+child+nodes
+++++++++++++++++++++tree(1241,n,n),++++++++++%25+a+leaf
+++++++++++++++++++++tree(1242,n,n))))++++++++%25+a+leaf|code-block|syntax|javascript|93890|很明显，"numbers“1、11、12、...、1242不是用来表示它们的数值的，而是用来代替它们的。换句话说，这些值并不重要。已经构建了一个有效的树。|offset|length|style|CODE|93891|这棵树的每个节点都有2个或4个子节点(可能为空，用n表示)。这就是为什么它被认为是2-+3+-4树，其中每个节点允许有2、3或4个子节点(可能为空)。|93892|然后你的问题就变成了，给定一个由Prolog复合术语表示的2-3-4树，就像上面那个一样，以很好的视觉方式打印这棵树，如所附图像所示。|93893|这只需将嵌套子树的打印与节点值的打印交换即可：|93894|print_tree(+n+).
print_tree(+tree(A,B,C)+)+:-+print_tree(B),+
+++++++++++++++++++++++++++++print_node_value(A),+
+++++++++++++++++++++++++++++print_tree(C).
print_tree(+tree(A,B,C,D)+)+:-+print_tree(B),+
+++++++++++++++++++++++++++++print_node_value(A),+
+++++++++++++++++++++++++++++print_tree(C),
+++++++++++++++++++++++++++++print_tree(D).
print_tree(+tree(A,B,C,D,E)+)+:-+print_tree(B),+
+++++++++++++++++++++++++++++print_tree(C),
+++++++++++++++++++++++++++++print_node_value(A),+
+++++++++++++++++++++++++++++print_tree(D),
+++++++++++++++++++++++++++++print_tree(E).|93895|在打印子节点时，您必须通过传入所需的缩进级别并将其递增相同的量来增加缩进级别。|93896|entityMap^0|0|0|D|1|F|2|I|2|P|4|0|P|1|0|0|0|0|0^^$0|@$1|2|3|4|5|6|7|Y|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|Z|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|6|7|10|8|@$I|11|J|12|K|L]|$I|13|J|14|K|L]|$I|15|J|16|K|L]|$I|17|J|18|K|L]]|9|@]|A|$]]|$1|M|3|N|5|6|7|19|8|@$I|1A|J|1B|K|L]]|9|@]|A|$]]|$1|O|3|P|5|6|7|1C|8|@]|9|@]|A|$]]|$1|Q|3|R|5|6|7|1D|8|@]|9|@]|A|$]]|$1|S|3|T|5|D|7|1E|8|@]|9|@]|A|$E|F]]|$1|U|3|V|5|6|7|1F|8|@]|9|@]|A|$]]|$1|W|3|-4|5|6|7|1G|8|@]|9|@]|A|$]]]|X|$]]

Here's your given term, pretty printed for clarity:

<pre class="lang-erlang prettyprint-override"><code>tree(1, % has 2 child nodes
 tree(11, % has 2 child nodes
 tree(111,n,n), % a leaf
 tree(112, % has 2 child nodes
 tree(1121,n,n), % a leaf
 n)), % empty
 tree(12, % has 4 child nodes
 tree(121,n,n), % a leaf
 tree(122,n,n), % a leaf
 tree(123,n,n), % a leaf
 tree(124, % has two child nodes
 tree(1241,n,n), % a leaf
 tree(1242,n,n)))) % a leaf
</code></pre>

It is clear that the "numbers" <code>1</code>, <code>11</code>, <code>12</code>, ..., <code>1242</code> aren't used for their numeric value, but just as stand-ins. In other words, the values are unimportant. A valid tree has already been built.

This tree's nodes each have either 2 or 4 child nodes (possibly empty, signified by <code>n</code>). That is why it is considered to be a 2-3-4 tree, where each node is allowed to have 2, 3, or 4 child nodes (possibly empty). 

Your question then becomes, given a 2-3-4 tree represented by a Prolog compound term like the one above, print the tree in the nice visual fashion as shown in your attached image.

This is achieved simply by swapping the printing of nested sub-trees with the printing of the node's value:

<pre><code>print_tree( n ).
print_tree( tree(A,B,C) ) :- print_tree(B), 
 print_node_value(A), 
 print_tree(C).
print_tree( tree(A,B,C,D) ) :- print_tree(B), 
 print_node_value(A), 
 print_tree(C),
 print_tree(D).
print_tree( tree(A,B,C,D,E) ) :- print_tree(B), 
 print_tree(C),
 print_node_value(A), 
 print_tree(D),
 print_tree(E).
</code></pre>

You will have to augment this by passing in the desired indentation level, and incrementing it, by the same amount, when printing the child nodes.

My prof gave me an exercise to do with prolog. Given this goal i have to build the corrispondent 234 tree:

<blockquote>
 write(tree(1,tree(11,tree(111,n,n),tree(112,tree(1121,n,n),n)),tree(12,tree(121,n,n),tree(122,n,n),
 tree(123,n,n),tree(124,tree(1241,n,n),tree(1242,n,n)))))
</blockquote>

The result should be something like this:

<a href="https://i.stack.imgur.com/eRXR8.png" rel="nofollow noreferrer"><img src="https://i.stack.imgur.com/eRXR8.png" alt="enter image description here"></a>

Are you asking what is my problem ?

I studied what is a 234 tree, but i dont understand why the tree i represented can be considered a 234 tree, what i see are numbers that range from 1 to 1242. Should a 234 tree be something like this ?

<a href="https://i.stack.imgur.com/HmSHL.gif" rel="nofollow noreferrer"><img src="https://i.stack.imgur.com/HmSHL.gif" alt="enter image description here"></a>

Prolog exercise 2-3-4 tree

翻译质量差，导致语言生硬或混乱。

没有提供实际的解决方法或示例。

解答不清晰，无法理解或解决问题。

页面排版不美观，阅读体验差。

文章

问答

视频

学习中心

腾讯云实验室

直播

竞赛

腾讯云代码分析专区

腾讯iOA零信任安全管理系统专区

腾讯云架构师技术同盟交流圈

腾讯云数据库专区

腾讯云顾问专区

腾讯云原生专区

腾讯混元专区

腾讯云TCE专区

腾讯云Lighthouse专区

腾讯云HAI专区

腾讯云Edgeone专区

腾讯云存储专区

腾讯云智能专区

腾讯轻联专区 

腾讯云开发专区

TAPD专区

腾讯轻量云游戏服专区

腾讯云最具价值专家

腾讯云架构师技术同盟

腾讯云创作之星

腾讯云开发者先锋

腾讯云代码助手

云原生构建

TAPD 敏捷项目管理

Cloud Studio

SDK中心

API中心

命令行工具

涵盖代码开发、场景应用、自动测试全流程，助你从零构建专属AI助手

一站式MCP教程库，解锁AI应用新玩法

我的教授给了我一个关于prolog的练习。考虑到这个目标，我必须构建对应的234树：树写入(  (1，树(11，树(111，n，n)，树(112，树(1121，n，n)，树(12，树(121，n，n)，树(122，n，n)，树(123，n，n)，树(124，树(1241，n，n)，树(1242，n，n)结果应该是这样的...

Prolog练习2-3-4树-腾讯云开发者社区-腾讯云

问Prolog练习2-3-4树
EN

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问Prolog练习2-3-4树EN

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问Prolog练习2-3-4树
EN